Real-Time Motion Planning of Construction Equipment Mechanism by Dual- Resolution Heuristic Search

نویسنده

  • Sabri Cetinkunt
چکیده

Introduction of embedded computer control in construction equipment paves the way for implementation of enhancements to improve overall productivity and competitiveness of machines. One of these features is the capability for automated or autonomous machine operation. This research present a memory efficient real-time motion planning algorithm for the blade linkage mechanism of a motor grader. This enables to execute repetitive blade positioning tasks and to move the blade between any two positions without operator interaction while automatically avoiding collision between the blade and frame or wheel parts during the motion of the blade. Collision-free blade configurations are obtained in a preprocessing phase utilizing deterministic dualresolution sampling. Moving obstacles such as front wheels and articulation functionality, both used for machine steering, are decoupled for complexity and memory reduction. Solutions to particular path planning problems are computed in real-time by heuristic driven A* path search. To enable path planning on current and future anticipated low-cost embedded computer resources of construction machinery, the search strategy is optimized by designing the behavior of heuristic functions specifically for this problem space. An adaptive closed-loop control approach is proposed enabling multi-axis coordinated motion control of the blade under varying load conditions and transient hydraulic system pressure fluctuations. The performance of the approach is evaluated, and simulation and experimental results show that path and trajectory planning can be accomplished in real-time on the target application.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchical Task Network Planner for Pathfinding in Real-Time Strategy Games

In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN ...

متن کامل

Improving lifting motion planning and re-planning of cranes with consideration for safety and efficiency

Please cite this article in press as: C. Zhang, A. efficiency, Adv. Eng. Informat. (2012), doi:10.10 Safe and efficient operation of cranes requires not only good planning, but also sufficient and appropriate support in real time. Due to the dynamic nature of construction sites, unexpected changes in site layout may create new obstacles for the crane that can result in collisions and accidents....

متن کامل

Real-Time Motion Planning with Dynamic Obstacles

Robust robot motion planning in dynamic environments requires that actions be selected under real-time constraints. Existing heuristic search methods that can plan high-speed motions do not guarantee real-time performance in dynamic environments. Existing heuristic search methods for realtime planning in dynamic environments fail in the highdimensional state space required to plan high-speed ac...

متن کامل

Real-time heuristic search for motion planning with dynamic obstacles

Robust robot motion planning in dynamic environments requires that actions be selected under real-time constraints. Existing heuristic search methods that can plan high-speed motions do not guarantee real-time performance in dynamic environments. Existing heuristic search methods for real-time planning in dynamic environments fail in the high-dimensional state space required to plan high-speed ...

متن کامل

Fast and Feasible Deliberative Motion Planner for Dynamic Environments

We present an approach to the problem of differentially constrained mobile robot motion planning in arbitrary time-varying cost fields. We construct a special search space which is ideally suited to the requirements of dynamic environments including a) feasible motion plans that satisfy differential constraints, b) efficient plan repair at high update rates, and c) deliberative goal-directed be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006